Multi-valued Action Languages in CLP(FD)

نویسندگان

  • Agostino Dovier
  • Andrea Formisano
  • Enrico Pontelli
چکیده

Action description languages, such as A and B (Gelfond and Lifschitz 1998), are expressive instruments introduced for formalizing planning domains and planning problem instances. The paper starts by proposing a methodology to encode an action language (with conditional effects and static causal laws), a slight variation of B, using Constraint Logic Programming over Finite Domains. The approach is then generalized to raise the use of constraints to the level of the action language itself. A prototype implementation has been developed, and the preliminary results are presented and discussed. To appear in Theory and Practice of Logic Programming (TPLP).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Planning with Action Languages: Perspectives using CLP(FD) and ASP

Action description languages, such as A and B (Gelfond and Lifschitz, 1998), are expressive tools introduced for formalizing planning domains and problems. In this work, we investigate two alternative approaches to the problem of encoding action languages using logic programming. Starting from a slight variation of B, we explore the use of Answer Set Programming (ASP) and Constraint Logic Progr...

متن کامل

Multi-Agent Planning in CLP

This paper explores the use of Constraint Logic Programming (CLP) as a platform for experimenting with planning problems in presence of multiple interacting agents. The paper develops a novel constraint-based action language, B, that enables the declarative description of large classes of multi-agent and multi-valued domains. B supports several complex features, including combined effects, conc...

متن کامل

Programming with TOY(FD)

In [1] we presented the language T OY(FD) that integrates the best features of existing functional and logic languages, as well as finite domain (FD) constraint solving. We believe that T OY(FD) is more flexible and expressive than the existing approaches of constraint logic programming on finite domain (CLP (FD) ) as it integrates FD constraint solving, lazy evaluation, higher order applicatio...

متن کامل

Computer Science Technical Reports Structweb: Biosequence Structure Searching on the Web Using Clp(fd) Structweb: Biosequence Structure Searching on the Web Using Clp(fd)

We describe an implementation in a nite domain constraint logic programming language of a web-based biosequence structure searching program. We have used the clp(FD) language for the implementation of our search engine and have ported the PiLLoW libraries to clp(FD). Our program is based on CBSDL, a constraint based structure description language for biosequences, and uses constrained descripti...

متن کامل

Correctness Considerations in CLP(FD) Systems

Constraint logic programming (CLP) is a declarative formalism for describing conditions a solution must satisfy. Constraint logic programming over finite domains, denoted as CLP(FD), considers problems involving integers, including combinatorial problems such as planning, scheduling and allocation tasks. Given a problem description, a constraint solver tries to find valid solutions via constrai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0912.2846  شماره 

صفحات  -

تاریخ انتشار 2009